A local algorithm for constructing non-negative cubic splines

An Algorithm for Vay Using Cubic B - Splines

Non-overshooting Hermite Cubic Splines for Keyframe Interpolation

e o A technique for limiting the knot slopes of hermite cubic splines in order to eliminat vershoot is proposed. It is proven that constraining each knot’s slope to lie between 0 and l three times the slope to the knot on either side forces all extrema to occur at knots. This al ows overshoot to be eliminated without sacrificing slope continuity. The technique has appli1 cations in keyframe int...

Constrained Interpolation via Cubic Hermite Splines

Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation.  It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...

Local lagrange interpolation with cubic C1 splines on tetrahedral partitions

We describe an algorithm for constructing a Lagrange interpolation pair based onC1 cubic splines defined on tetrahedral partitions. In particular, given a set of points V ∈ R3, we construct a set P containing V and a spline space S3( ) based on a tetrahedral partition whose set of vertices include V such that interpolation at the points of P is well-defined and unique. Earlier results are exten...

Local Lagrange Interpolation by Bivariate C 1 Cubic Splines

Lagrange interpolation schemes are constructed based on C 1 cubic splines on certain triangulations obtained from checkerboard quad-rangulations. x1. Introduction Given a triangulation 4 of a simply connected polygonal domain , the space of C 1 cubic splines is deened by S 1 3 (4) := fs 2 C 1 (() : sj T 2 P 3 , all T 2 4g; where P 3 is the space of cubic bivariate polynomials. In this paper we ...